Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
131	Hallucination Helps: Energy Efficient Virtual Circuit Routing Antonios Antoniadis∗ Benjamin Moseley§ Sungjin Im† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-07-07 11:17:18 Combinatorial optimization Operations research Network flow Analysis of algorithms Computational complexity theory Time complexity Shortest path problem Cut Flow network Theoretical computer science Mathematics Applied mathematics
132	Simultaneous Source Location Konstantin Andreev1? , Charles Garrod1? , Bruce Maggs1 , and Adam Meyerson2? 1 2 Add to Reading List Source URL: www.akamai.com Language: English - Date: 2006-09-21 21:38:54 Tree decomposition Maximum flow problem Flow network Connectivity Path decomposition Branch-decomposition Graph theory Network flow Graph operations
133	Capacitated Network Design on Undirected Graphs Deeparnab Chakrabarty∗ Ravishankar Krishnaswamy† Shi Li‡ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-06-17 04:09:52 Network flow Graph connectivity Operations research Maximum flow problem Max-flow min-cut theorem Flow network Graph Cut Minimum cut Graph theory Mathematics Combinatorial optimization
134	Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing Ravishankar Krishnaswamy∗ Viswanath Nagarajan† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-11-12 10:28:36 Combinatorics Combinatorial optimization Flow network Cluster analysis Max-flow min-cut theorem Cut Minimum-cost flow problem Maximum flow problem CURE data clustering algorithm Graph theory Network flow Mathematics
135	Maximum Gain Round Trips with Cost Constraints Franz Graf, Hans-Peter Kriegel, Matthias Schubert arXiv:1105.0830v1 [cs.SI] 4 May 2011 Add to Reading List Source URL: www.dbs.ifi.lmu.de Language: English - Date: 2011-05-05 02:44:43 Search algorithms Combinatorial optimization Routing algorithms Operations research Network theory A* search algorithm Shortest path problem Flow network Tree Graph theory Mathematics Theoretical computer science
136	1 Scalable Min-Register Retiming Under Timing and Initializability Constraints Aaron P. Hurst, Alan Mishchenko, and Robert K. Brayton University of California, Berkeley Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-04-03 12:04:29 Formal methods Mathematics Network flow Retiming Electronic design automation Electronic design Maximum flow problem Design closure Clock skew Electronic engineering Operations research Electronics
137	Earth Mover’s Distance based Similarity Search at Scale Yu Tang† , Leong Hou U‡ , Yilun Cai† , Nikos Mamoulis† , Reynold Cheng† † † {ytang, Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-11-07 15:10:21 Theoretical computer science Shortest path problem Histogram Maximum flow problem Flow network Minimum-cost flow problem Matching Mathematics Graph theory Network flow
138	RESEARCH FEATURE Self-Organization and Identification of Web Communities Despite its decentralized and unorganized nature, the Web self-organizes Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-12-04 14:11:42 Network flow Combinatorial optimization Search algorithms PageRank Cut Flow network Maximum flow problem Algorithm Hyperlink Mathematics Graph theory Theoretical computer science
139	Scalable Influence Maximization in Social Networks under the Linear Threshold Model Wei Chen Microsoft Research Asia Beijing, China Email: [removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:24 Network theory Network flow Networks Operations research Directed acyclic graph Shortest path problem Topological sorting Centrality Flow network Graph theory Mathematics Theoretical computer science
140	Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms TOM LEIGHTON Massachusetts Institute of Technology, Cambridge, Massachusetts AND Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:52 Network flow Combinatorial optimization Flow network Maximum flow problem Minimum cut Cut Max-flow min-cut theorem Connectivity Graph partition Mathematics Graph theory Theoretical computer science

UPDATE